Covering a graph with cuts of minimum total size
نویسندگان
چکیده
منابع مشابه
Covering a graph with cuts of minimum total size
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V (G)− S. A cut-cover of G is a collection of cuts whose union is E(G) and the total size of a cut-cover is the sum of the number of edges of the cuts in the cover. The cut-cover size of a graph G, denoted by cs(G), is the minimum total size of a cut-cover of G. We give general bounds on cs(G), find...
متن کاملCovering Complete Hypergraphs with Cuts of Minimum Total Size
A cut [X,V −X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V −X. Let sr(n) denote the minimum total size of any cover of the edges of the complete r-uniform hypergraph on n vertices Kr n by cuts. We show that there is a number nr such that for every n > nr, sr(n) is uniquely achieved by a cover with � n−1 r−1 � cuts [Xi, V −Xi] such that the Xi are pairwise di...
متن کاملHow to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus is transformed into a hierarchical clustering of the graph that contains complete information on all the minimum cuts. This approach is then extended to drawings in which the two vertex subsets of every minimum cut ar...
متن کاملOn the Number of Minimum Cuts in a Graph
We relate the number of minimum cuts in a weighted undirected graph with various structural parameters of the graph. In particular, we provide upper bounds for the number of minimum cuts in terms of the radius, diameter, minimum degree, maximum degree, chordality, girth, and some other parameters of the graph.
متن کاملGraph Partition Problems with Minimum Size Constraints
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . x
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00367-8